A Game Approach to Determinize Timed Automata

Timed automata are a usual model for the specification of real time systems. Their determinization is a key issue for several problems such as implementability, diagnosis or test generation. There exist non-determinizable timed automata and, unfortunately, determinizability of timed automata is an undecidable problem. Recently, two approaches have been proposed: a determinization procedure [2] which terminates on some determinizable classes and an algorithm [6] that produces a deterministic over-approximation. In this paper, we propose a game approach covering both. This method is at once more general than the procedure of [2] and more precise than the approximation algorithm of [6].